#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],sum[maxn];
map<LL,LL>map1;
int main(void)
{
    cin.tie(0);std::ios::sync_with_stdio(false);
    LL n;cin>>n;
    for(LL i=1;i<=n;i++) cin>>a[i];
    for(LL i=1;i<=n;i++) sum[i]=sum[i-1]+a[i];
    LL ans=0;LL p=0;
    map1[0]=0;
   /// for(LL i=1;i<=n;i++) cout<<sum[i]<<" ";
   /// cout<<endl;
    for(LL i=1;i<=n;i++){
        if(map1.count(sum[i])) p=max(map1[sum[i]]+1,p);
        map1[sum[i]]=i;
     ///   debug(p);
        if(sum[i]==sum[i-1]) {p=i;continue;}
        ans+=i-p;
    }
    cout<<ans<<endl;
return 0;
}
